#include<stdio.h>

int main()
{
	int arr[10] = { 1, 12, 23, 53, 16, 43, 4, 7, 13, 67 };
	int n = (sizeof(arr[10]) / sizeof(arr[0]));

	//bubblesort(arr, n);

	int i, j, temp;
	for (i = 0; i <= n - 1; ++i)
	{
		for (j = 0; j <= n - 1 - i; ++j)
		{
			if (arr[j] > arr[j + 1])
			{
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
		}
	}
	for (int k = 0; k < n; ++k)
	{
		printf("%d ", arr[k]);
	}
	return 0;
}
